Graph Isomorphism, Color Refinement, and Compactness
نویسندگان
چکیده
منابع مشابه
A new refinement procedure for graph isomorphism algorithms
Two vertices of a graph are said to be similar if there exists a graph automorphism mapping one of them into the other. Procedures aiming to separate vertices of a graph into equivalence classes accordingly to their similarities are the basis of many isomorphism-testing algorithms. In practice, these procedures efficiently reduce the search space of backtracking-based techniques. We present a n...
متن کاملOn Hypergraph and Graph Isomorphism with Bounded Color Classes
Using logspace counting classes we study the computational complexity of hypergraph and graph isomorphism where the vertex sets have bounded color classes for certain specific bounds. We also give a polynomial-time algorithm for hypergraph isomorphism for bounded color classes of arbitrary size.
متن کاملInformalogical Space: Decomposition, Compactness and Isomorphism
In a previous paper, we presented a meaning based information theory in which the core concept is an informalogical space. We introduced the concepts of an information net in an informalogical space, a piece of limit information of an information net, a separated informalogical space and a first countable informalogical space. We built a convergence theory of information nets and applied the co...
متن کاملGraph Invariants and Graph Isomorphism
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...
متن کاملGraph Isomorphism
While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2016
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-016-0147-6